??LETMELER?N ETK?NL?KLER? ?LE F?NANSAL PERFORMANSLARI ARASINDAK? ?L??K?: B?L???M SEKTÖRÜ ÜZER?NE B?R ARA?TIRMA

Large Finite Structures with Few Lk-Types

For each k 3, we show that there is no recursive bound for the size of the smallest finite model of an Lk-theory in terms of its k-size. Here Lk denotes the k-variable fragment of first-order logic. An Lk-theory is a maximal consistent set of Lk-sentences, and the k-size of an Lk-theory is the number of Lk-types realized in its models. Our result answers a question of Dawar [3, 2]. As a corolla...

The state complexity of L2 and Lk

We show that if M is a DFA with n states over an arbitrary alphabet and L = L(M), then the worst-case state complexity of L2 is n2 − 2n−1. If, however, M is a DFA over a unary alphabet, then the worst-case state complexity of L is kn− k + 1 for all k ≥ 2.

The transition from HK to LK phenotype in the red cells of newborn genetically LK lambs

Red cells from newborn lambs were separated into different age populations by centrifugation, and cells with fetal hemoglobin (Hb) were distinguished from those with adult Hb by an acid elution technique. Changes were followed during development in rates of K+ transport (active and passive), numbers of Na+/K+ pump sites per cell, cell volumes, and numbers of Lp and L1 antigen sites per cell. Th...

LE 2 LE 3 LE 4 LE 5 LE 6 LE 7 LE 8 Local InterconnectLook − up Tables PLA Global

Parsing Non-LK( k ) Grammars with Yacc

Of the parser generating tools currently in use, yacc (or one of its several variants) is perhaps the most frequently employed. However, because of inherent ambiguities there are some languages (such as C++) that a yacc-generated parser cannot successfully compile. This paper describes a set of minor modifications to yacc-like tools that allows them to be used in a straightforward way to parse ...